0.08/0.12 % Problem : SLH0145^1 : TPTP v8.2.0. Released v8.2.0. 0.08/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s 0.12/0.34 Computer : n023.cluster.edu 0.12/0.34 Model : x86_64 x86_64 0.12/0.34 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 RAMPerCPU : 8042.1875MB 0.12/0.34 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 30 0.12/0.34 % DateTime : Mon Jul 3 03:56:51 EDT 2023 0.12/0.34 % CPUTime : 6.19/6.42 % SZS status Theorem 6.19/6.42 % Mode: mode507:USE_SINE=true:SINE_TOLERANCE=3.0:SINE_GENERALITY_THRESHOLD=0:SINE_RANK_LIMIT=1.:SINE_DEPTH=1 6.19/6.42 % Inferences: 551 6.19/6.42 % SZS output start Proof 6.19/6.42 thf(ty_nat, type, nat : $tType). 6.19/6.42 thf(ty_dtree_list_a_b, type, dtree_list_a_b : $tType). 6.19/6.42 thf(ty_list_a, type, list_a : $tType). 6.19/6.42 thf(ty_real, type, real : $tType). 6.19/6.42 thf(ty_pre_pr7278220950009878019t_unit, type, pre_pr7278220950009878019t_unit : $tType). 6.19/6.42 thf(ty_rank, type, rank : (list_a>real)). 6.19/6.42 thf(ty_iKKBZ_3908525916494739553en_a_b, type, iKKBZ_3908525916494739553en_a_b : (dtree_list_a_b>pre_pr7278220950009878019t_unit>$o)). 6.19/6.42 thf(ty_ranked_normalize_a_b, type, ranked_normalize_a_b : ((list_a>real)>dtree_list_a_b>dtree_list_a_b)). 6.19/6.42 thf(ty_t2, type, t2 : dtree_list_a_b). 6.19/6.42 thf(ty_list_wf_dlverts_a_b, type, list_wf_dlverts_a_b : (dtree_list_a_b>$o)). 6.19/6.42 thf(ty_t, type, t : pre_pr7278220950009878019t_unit). 6.19/6.42 thf(ty_ranked8905849569120154423e1_a_b, type, ranked8905849569120154423e1_a_b : ((list_a>real)>dtree_list_a_b>dtree_list_a_b)). 6.19/6.42 thf(ty_one_one_nat, type, one_one_nat : nat). 6.19/6.42 thf(ty_ord_less_eq_nat, type, ord_less_eq_nat : (nat>nat>$o)). 6.19/6.42 thf(ty_t1a, type, t1a : dtree_list_a_b). 6.19/6.42 thf(ty_max_deg_list_a_b, type, max_deg_list_a_b : (dtree_list_a_b>nat)). 6.19/6.42 thf(sP1,plain,sP1 <=> (![X1:dtree_list_a_b]:(((ord_less_eq_nat @ (max_deg_list_a_b @ ((ranked_normalize_a_b @ rank) @ X1))) @ one_one_nat) => ((list_wf_dlverts_a_b @ X1) => ((ord_less_eq_nat @ (max_deg_list_a_b @ X1)) @ one_one_nat)))),introduced(definition,[new_symbols(definition,[sP1])])). 6.19/6.42 thf(sP2,plain,sP2 <=> ((ord_less_eq_nat @ (max_deg_list_a_b @ ((ranked_normalize_a_b @ rank) @ t1a))) @ one_one_nat),introduced(definition,[new_symbols(definition,[sP2])])). 6.19/6.42 thf(sP3,plain,sP3 <=> ((ord_less_eq_nat @ (max_deg_list_a_b @ t1a)) @ one_one_nat),introduced(definition,[new_symbols(definition,[sP3])])). 6.19/6.42 thf(sP4,plain,sP4 <=> (sP2 => ((list_wf_dlverts_a_b @ t1a) => sP3)),introduced(definition,[new_symbols(definition,[sP4])])). 6.19/6.42 thf(sP5,plain,sP5 <=> ((list_wf_dlverts_a_b @ t1a) => sP3),introduced(definition,[new_symbols(definition,[sP5])])). 6.19/6.42 thf(sP6,plain,sP6 <=> (list_wf_dlverts_a_b @ t1a),introduced(definition,[new_symbols(definition,[sP6])])). 6.19/6.42 thf(conj_0,conjecture,sP3). 6.19/6.42 thf(h0,negated_conjecture,(~(sP3)),inference(assume_negation,[status(cth)],[conj_0])). 6.19/6.42 thf(h1,assumption,(~(((ord_less_eq_nat @ (max_deg_list_a_b @ ((ranked8905849569120154423e1_a_b @ rank) @ t2))) @ one_one_nat))),introduced(assumption,[])). 6.19/6.42 thf(h2,assumption,((~((((ranked8905849569120154423e1_a_b @ rank) @ t2) = t2))) => ((iKKBZ_3908525916494739553en_a_b @ ((ranked8905849569120154423e1_a_b @ rank) @ t2)) @ t)),introduced(assumption,[])). 6.19/6.42 thf(1,plain,(~(sP1) | sP4),inference(all_rule,[status(thm)],[])). 6.19/6.42 thf(2,plain,((~(sP4) | ~(sP2)) | sP5),inference(prop_rule,[status(thm)],[])). 6.19/6.42 thf(3,plain,((~(sP5) | ~(sP6)) | sP3),inference(prop_rule,[status(thm)],[])). 6.19/6.42 thf(fact_12__C1_Oprems_C_I1_J,axiom,sP2). 6.19/6.42 thf(fact_2_mdeg__le1__normalize,axiom,sP1). 6.19/6.42 thf(fact_1__C1_Oprems_C_I3_J,axiom,sP6). 6.19/6.42 thf(4,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,h0,fact_12__C1_Oprems_C_I1_J,fact_2_mdeg__le1__normalize,fact_1__C1_Oprems_C_I3_J])). 6.19/6.42 thf(h3,assumption,(((ranked8905849569120154423e1_a_b @ rank) @ t2) = t2),introduced(assumption,[])). 6.19/6.42 thf(h4,assumption,((iKKBZ_3908525916494739553en_a_b @ ((ranked8905849569120154423e1_a_b @ rank) @ t2)) @ t),introduced(assumption,[])). 6.19/6.42 thf(5,plain,(~(sP1) | sP4),inference(all_rule,[status(thm)],[])). 6.19/6.42 thf(6,plain,((~(sP4) | ~(sP2)) | sP5),inference(prop_rule,[status(thm)],[])). 6.19/6.42 thf(7,plain,((~(sP5) | ~(sP6)) | sP3),inference(prop_rule,[status(thm)],[])). 6.19/6.42 thf(8,plain,$false,inference(prop_unsat,[status(thm),assumptions([h3,h2,h0])],[5,6,7,h0,fact_12__C1_Oprems_C_I1_J,fact_2_mdeg__le1__normalize,fact_1__C1_Oprems_C_I3_J])). 6.19/6.42 thf(9,plain,(~(sP1) | sP4),inference(all_rule,[status(thm)],[])). 6.19/6.42 thf(10,plain,((~(sP4) | ~(sP2)) | sP5),inference(prop_rule,[status(thm)],[])). 6.19/6.42 thf(11,plain,((~(sP5) | ~(sP6)) | sP3),inference(prop_rule,[status(thm)],[])). 6.19/6.42 thf(12,plain,$false,inference(prop_unsat,[status(thm),assumptions([h4,h2,h0])],[9,10,11,h0,fact_12__C1_Oprems_C_I1_J,fact_2_mdeg__le1__normalize,fact_1__C1_Oprems_C_I3_J])). 6.19/6.42 thf(13,plain,$false,inference(tab_imp,[status(thm),assumptions([h2,h0]),tab_imp(discharge,[h3]),tab_imp(discharge,[h4])],[h2,8,12,h3,h4])). 6.19/6.42 thf(fact_386_dom__mdeg__le1__normalize1,axiom,(((ord_less_eq_nat @ (max_deg_list_a_b @ ((ranked8905849569120154423e1_a_b @ rank) @ t2))) @ one_one_nat) => ((~((((ranked8905849569120154423e1_a_b @ rank) @ t2) = t2))) => ((iKKBZ_3908525916494739553en_a_b @ ((ranked8905849569120154423e1_a_b @ rank) @ t2)) @ t)))). 6.19/6.42 thf(14,plain,$false,inference(tab_imp,[status(thm),assumptions([h0]),tab_imp(discharge,[h1]),tab_imp(discharge,[h2])],[fact_386_dom__mdeg__le1__normalize1,4,13,h1,h2])). 6.19/6.42 thf(0,theorem,sP3,inference(contra,[status(thm),contra(discharge,[h0])],[14,h0])). 6.19/6.42 % SZS output end Proof 6.19/6.42 EOF